tree n. 特里〔姓氏〕。 n. 1.樹(shù)〔主要指喬木,也可指較大的灌木〕。 ★玫瑰可以稱為 bush, 也可以稱為 tree. 2.木料,木材;木構(gòu)件;〔古語(yǔ)〕絞首臺(tái);〔the tree〕(釘死耶穌的)十字架;鞋楦。 3.樹(shù)形(物),世系圖,家系 (=family tree);【數(shù)學(xué)】樹(shù)(形);【化學(xué)】樹(shù)狀晶體。 a banana tree 香蕉樹(shù)。 an axle-tree 心棒,軸料。 a boot-tree 靴楦[型]。 a saddle-tree 鞍架。 at the top of the tree 在最高地位。 tree of Buddha 菩提樹(shù)。 tree of heaven 臭椿。 tree of knowledge (of good and evil) 【圣經(jīng)】知道善惡的樹(shù),智慧之樹(shù)。 tree of life 生命之樹(shù),生命力的源泉【植物;植物學(xué)】金鐘柏。 up a tree 〔口語(yǔ)〕進(jìn)退兩難,不知所措。 vt. 趕(獵獸等)上樹(shù)躲避;〔口語(yǔ)〕使處于困境;窮追;把鞋型插入(鞋內(nèi))。
construction n. 1.建筑,結(jié)構(gòu),構(gòu)造,架設(shè),鋪設(shè);建設(shè);設(shè)計(jì);工程;建筑法,構(gòu)造法,建筑物;【戲劇】搭置,布景,結(jié)構(gòu),編排。 2.(法律等的)解釋;推定。 3.【語(yǔ)法】結(jié)構(gòu)(體);句法結(jié)構(gòu);構(gòu)詞法;【數(shù)學(xué)】作圖。 capital construction基本建設(shè)。 the order of construction施工程序。 a sandwich construction層狀結(jié)構(gòu)。 bear a construction 可作某一解釋;可解釋為。 put a false construction on 故意曲解。 put a good [bad] construction upon 善[惡]意解釋。 under [in course of] construction 建筑中,建造中。 construction-way 臨時(shí)鐵路,毛路。 construction engine 工程機(jī)車。 construction gang 〔美國(guó)〕鐵路土方工人隊(duì)。 construction gauge 【工業(yè)】建筑界限。 construction labourer 〔美國(guó)〕鐵路土方工人。 construction problem 【數(shù)學(xué)】作圖題。 construction train 建設(shè)材料運(yùn)輸列車。 construction work 建設(shè)工程。 adj. -al
Tree construction is a commonly used approach in solving the multicast routing problem with constraints 帶約束的多播路由算法就是要尋求一棵滿足給定約束且費(fèi)用最小的多播樹(shù)。
Tree construction is a commonly used approach in solving the multicast and group multicast routing problem 本文主要研究多播和群播路由算法,即建立滿足各種業(yè)務(wù)服務(wù)質(zhì)量需求的多播樹(shù)。
The construction algorithm embodies three parts that are suffix sorting , logest common prefix evaluation process and child suffix tree construction 整個(gè)建立算法包括三個(gè)部分:后綴排序,計(jì)算最短公共前綴和建立子后綴樹(shù)。
A fundamental issue in multicast communication is how to determine an efficient message route ( multicast routing ) . tree construction is a commonly used approach in solving the multicast routing problem 本文主要研究多播路由算法,即建立滿足媒體傳輸服務(wù)質(zhì)量( qos : qualityofservice )需求的多播樹(shù)。
In computer networks , multicasting is becoming increasingly important . tree construction is a commonly used approach arises from the ability to potentially share many links in transmitting the message to destination set 實(shí)現(xiàn)多播的一般方式是建立多播樹(shù),多播樹(shù)是根為源節(jié)點(diǎn),且覆蓋所有多播成員的一棵樹(shù)。
Then in - depth analysed some key technologies including the webpage content extracting , the website topological structure analysis , the website subject analysis & indexing and the website retrieval . especially , some novety solutions , such as the content extraction methology based on the space length of tags , the website tree construction methology based on the similarty of directory in url , and the website concept methology basd on the structure of website , are proposed . finally on the basis of the algorithms and theory , the intellectual websites retrieval system is built and the experiments proved that it can achieve better results 根據(jù)以上研究目的,本文首先分析了智能網(wǎng)站檢索技術(shù)的構(gòu)造與實(shí)現(xiàn),提出了基于主題標(biāo)引的智能網(wǎng)站檢索系統(tǒng)的系統(tǒng)結(jié)構(gòu)與實(shí)現(xiàn)策略,之后對(duì)系統(tǒng)中的主題分析、標(biāo)引與檢索等關(guān)鍵技術(shù)進(jìn)行了深入分析,針對(duì)主要技術(shù)難點(diǎn)重點(diǎn)討論了網(wǎng)頁(yè)正文抽取,網(wǎng)站拓?fù)浣Y(jié)構(gòu)分析,網(wǎng)站主題獲取等相關(guān)實(shí)現(xiàn)技術(shù),提出了基于標(biāo)簽間距的正文抽取算法,基于url目錄相似度的網(wǎng)站結(jié)構(gòu)分析算法和基于網(wǎng)站結(jié)構(gòu)的網(wǎng)站主題概念獲取算法等解決方案。
Tree construction is a commonly used approach in solving the multicast routing problem . one advantage of multicast tree is that data are distributed to different multicasting destinations along the branches in parallel , which reduces the delay . the other is that message need only be replicated at forking nodes , which minimizes the data replication , spares the network bandwidth , reduces the network load and lessens the congestion 實(shí)現(xiàn)組播的一般方式是建立組播樹(shù),組播樹(shù)的優(yōu)點(diǎn)在于:首先,信息以并行方式沿著樹(shù)枝發(fā)送到不同的組播終點(diǎn),從而降低了信息傳遞的時(shí)延;其次,信息的復(fù)制只在樹(shù)的分支處進(jìn)行,因此網(wǎng)絡(luò)中需要傳送的復(fù)制信息量最少,能夠節(jié)約網(wǎng)絡(luò)帶寬資源,降低網(wǎng)絡(luò)負(fù)載,減少擁塞。
Firstly a routing problem among transistor groups is brought forward . by analyzing the property of optimized rectangle steiner tree , an algorithm of approximate rectangle steiner tree construction is proposed . according to the mutual exclusion relationship among the net ports in the dvcs , the strategy for choosing connection ports is advanced 論文首先提出了晶體管群之間的線網(wǎng)布線問(wèn)題,通過(guò)分析優(yōu)化矩形斯坦納樹(shù)的性質(zhì),提出了一種符合宏單元布局特征的近似矩形斯坦納樹(shù)構(gòu)造算法,同時(shí)針對(duì)晶體管群dvc內(nèi)引線端點(diǎn)間走線互斥關(guān)系,提出斯坦納樹(shù)可選端點(diǎn)篩選策略。
Including the following areas of contents : first , based on windows interface , a design and implementation method of computer aided active fta constructing method was presented . according to this method , the visualized active fault tree construction software was developed . and the worse versatility and huge working load problems of fta construction were solved 主要做了以下幾方面的工作:首先,提出了一種基于windows界面的計(jì)算機(jī)輔助動(dòng)態(tài)建造故障樹(shù)的設(shè)計(jì)思想和實(shí)現(xiàn)方法,并在此基礎(chǔ)上設(shè)計(jì)開(kāi)發(fā)了一套可視化動(dòng)態(tài)建造故障樹(shù)軟件,解決了當(dāng)前建樹(shù)方法通用性差和工作量大的問(wèn)題。